VNS Based MADM-Strategy Under Possibility Environment

نویسندگان

چکیده

In this paper, we propose a Variable Neighborhood Search (VNS) algorithm based on Multi-AttributeDecision-Making (MADM) strategy under possibility environment. Further, provide numerical example to show the applicability and rationality of proposed MADM strategy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MADM strategy based on some similarity measures in interval bipolar neutrosophic set environment

The paper investigates some similarity measures in interval bipolar neutrosophic environment for multi-attribute decision making problems. At first, we define Hamming and Euclidean distances measures between interval bipolar neutrosophic sets and establish their basic properties. We also propose two similarity measures based on the Hamming and Euclidean distance functions. Using maximum and min...

متن کامل

NC - Cross Entropy Based MADM under 1 Neutrosophic Cubic Set Environment 2

Surapati Pramanik 1*, Shyamal Dalapati 2, Shariful Alam 2, Florentin Smarandache 3 and 3 Tapan Kumar Roy 2 4 1 Department of Mathematics, Nandalal Ghosh B.T. College, Panpur, P.O.-Narayanpur, District–North 24 5 Parganas, Bhatpara 743126, West Bengal, India 6 2 Department of Mathematics, Indian Institute of Engineering Science and Technology, Shibpur, P.O.7 Botanic Garden, Howrah 711103, West B...

متن کامل

An Intelligent Network Selection Strategy Based on MADM Methods in Heterogeneous Networks

Providing service continuity to the end users with best quality is a very important issue in the next generation wireless communications. With the evolution of the mobile devices towards a multimode architecture and the coexistence of multitude of radio access technologies (RAT’s), the users are able to benefit simultaneously from these RAT’s. However, the major issue in heterogeneous wireless ...

متن کامل

Goal Clustering: VNS based heuristics

Given a set V of n elements on m attributes, we want to find a partition of V on the minimum number of clusters such that the associated R-squared ratio is at least a given threshold. We denote this problem as Goal Clustering (GC). This problem represents a new perspective, characterizing a different methodology within unsupervised non-hierarchical clustering. In effect, while in the k -means w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Data Science

سال: 2022

ISSN: ['2198-5804', '2198-5812']

DOI: https://doi.org/10.1007/s40745-022-00419-3